#include <vector>
#include <fstream>
#include <iostream>
#include <algorithm>

using namespace std;
using square = vector<vector<char>>;
/*
@-@
---
@@-

@-@
@--
--@
*/

void clockwise90(square &m) {
  // 方法一
  // m[i][j] -> m[j][N - i - 1]

  // 方法二
  // 求 m 的转置矩阵
  // 对 m 垂直翻转
}

void clockwise180(square &m) {
  
}

void clockwise270(square &m) {
  
}

void reflection(square &m) {
  
}



int main(int argc, char const *argv[])
{
  /* code */
  square src, dst;

  ifstream ifs("Transform.in");

  int n = 0;
  ifs >> n;

  
  for (int i = 0; i < n; ++i) {
    vector<char> line;

    for (int j = 0; j < n; ++j) {
      char c = '\0';
      ifs >> c;
      line.push_back(c);
    }
    
    src.push_back(line);
  }

  for (int i = 0; i < n; ++i) {
    vector<char> line;

    for (int j = 0; j < n; ++j) {
      char c = '\0';
      ifs >> c;
      line.push_back(c);
    }
    
    dst.push_back(line);
  }
  return 0;
}
